Parallel Algorithms for Connected Components
نویسندگان
چکیده
In this paper, we describe our implementation of several parallel graph algorithms for nding connected components. Our implementation, with virtual processing, is on a 16,384-processor MasPar MP-1 using the language MPL. We present extensive test data on our code. In our previous projects [21, 22, 23], we reported the implementation of an extensible parallel graph algorithms library. We developed general implementation and ne-tuning techniques without expending too much e ort on optimizing each individual routine. We also handled the issue of implementing virtual processing. In this paper, we describe several algorithms and ne-tuning techniques that we developed for the problem of nding connected components in parallel; many of the ne-tuning techniques are of general interest, and should be applicable to code for other problems. We present data on the execution time and memory usage of our various implementations. 1991 Mathematics Subject Classi cation. Primary 68-04; Secondary 05-04, 05C85, 68Q22.
منابع مشابه
Comparing Parallel Simulated Annealing, Parallel Vibrating Damp Optimization and Genetic Algorithm for Joint Redundancy-Availability Problems in a Series-Parallel System with Multi-State Components
In this paper, we study different methods of solving joint redundancy-availability optimization for series-parallel systems with multi-state components. We analyzed various effective factors on system availability in order to determine the optimum number and version of components in each sub-system and consider the effects of improving failure rates of each component in each sub-system and impr...
متن کاملEfficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
This article presents parallel algorithms for component decomposition of graph structures on general purpose graphics processing units (GPUs). In particular, we consider the problem of decomposing sparse graphs into strongly connected components, and decomposing graphs induced by stochastic games (such as Markov decision processes) into maximal end components. These problems are key ingredients...
متن کاملA Comparison of Data-Parallel Algorithms for Connected Components
This paper presents a pragmatic comparison of three parallel algorithms for nding connected components, together with optimizations on these algorithms. Those being compared are two similar algorithms by Awerbuch and Shiloach 2] and by Shiloach and Vishkin 19] and a randomized contraction algorithm by Blelloch 7], based on algorithms by Reif 18] and Phillips 17]. Major improvements are given fo...
متن کاملParallel and External List Ranking and Connected Components
Improved parallel, external and parallel-external algorithms for list-ranking and computing the connected components of a graph are presented. These algorithms are implemented and tested on a cluster of workstations using the C programming language and mpich, a portable implementation of the MPI (Message-Passing Interface) standard.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996